Degree-preserving spanning trees in small-degree graphs
نویسندگان
چکیده
منابع مشابه
Spanning Trees of Small Degree
In this paper we show that pseudo-random graphs contain spanning trees of maximum degree 3. More specifically, (n, d, λ)-graphs with sufficiently large spectral gap contain such spanning trees.
متن کاملSpanning Trees of Bounded Degree Graphs
We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by d. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of exponential algorithms. The value of interest is the constant βd such that all connected graphs with degree bound ed by d have at least β d spanning trees wher...
متن کاملDegree Bounded Spanning Trees
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for every independent set S ⊆ V(G) of cardinality n(k − 1) + c + 2, there exists a vertex set X ⊆ S of cardinality k such that the degree sum of vertices in X is at least |V(G)| − c − 1. Then G has a spanning tree T with maximum de...
متن کاملDegree-constrained spanning trees
S of the Ghent Graph Theory Workshop on Longest Paths and Longest Cycles Kathie Cameron Degree-constrained spanning trees 2 Jan Goedgebeur Finding minimal obstructions to graph coloring 3 Jochen Harant On longest cycles in essentially 4-connected planar graphs 3 Frantǐsek Kardoš Barnette was right: not only fullerene graphs are Hamiltonian 4 Gyula Y. Katona Complexity questions for minimally t-...
متن کاملDegree-preserving spanning trees on strongly chordal graphs and directed path graphs
Suppose G is a connected graph and T a spanning tree of G. A vertex v ∈ V (G) is said to be a degree-preserving vertex if its degree in T is the same as in G. The degree-preserving spanning tree problem is to find a spanning tree T of a connected graph G such that the number of degreepreserving vertices is maximum. The purpose of this paper is to give an O(mα(m,n))-time algorithm for the degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00005-4